294A - Shaass and Oskols - CodeForces Solution


implementation math *800

Please click on ads to support us..

Python Code:

n = int(input())
a = [int(i) for i in input().split()]
m = int(input())
for i in range(m):
    wire , bird = [int(j) for j in input().split()]
    if wire < n:
        a[wire] += a[wire - 1] - bird

    if wire - 2 >= 0:
        a[wire - 2] += bird - 1

    a[wire - 1] = 0

for j in range(n):
    print(a[j])     

C++ Code:

#include <bits/stdc++.h>

using namespace std;

int main() {
  int n,value;
  cin >> n;
  int arr[n];
  for (int i = 0; i < n; ++i) {
    cin >> value;
    arr[i] = value;
  }
  int t;
  cin >> t;
  while (t--){
    int x , y;
    cin >> x >> y;
    x--;
    if ( x == sizeof(arr)/4 - 1){
      arr[x-1] += arr[x]-(arr[x] - y) - 1;
      arr[x]=0;
    }
    else {
      arr[x-1] += arr[x]-(arr[x] - y) - 1;
      arr[x+1] += arr[x]-y;
      arr[x] = 0;
    }
  }
  for (int i = 0; i < sizeof(arr)/4; ++i) {
    cout << arr[i] << endl;
  }
  return 0;
}
 	  			  		  	  	 	    				


Comments

Submit
0 Comments
More Questions

750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK
1635A - Min Or Sum
474A - Keyboard
1343A - Candies
1343C - Alternating Subsequence
1325A - EhAb AnD gCd
746A - Compote
318A - Even Odds
550B - Preparing Olympiad
939B - Hamster Farm
732A - Buy a Shovel
1220C - Substring Game in the Lesson
452A - Eevee